Branch and bound

Results: 97



#Item
31Computing / Local consistency / Constraint optimization / Constraint satisfaction problem / Constraint satisfaction / Backtracking / Branch and bound / Pruning / Decomposition method / Constraint programming / Software engineering / Computer programming

Weighted Constraint Satisfaction Problems with Min-Max Quantifiers∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong {jlee,wk

Add to Reading List

Source URL: www.tmak.info

Language: English - Date: 2013-10-06 08:30:44
32Computing / Local consistency / Constraint optimization / Distributed constraint optimization / Constraint satisfaction problem / Backjumping / Assignment / Search algorithm / Branch and bound / Constraint programming / Software engineering / Computer programming

Journal of Artificial Intelligence Research Submitted 04/08; publishedAsynchronous Forward Bounding for Distributed COPs Amir Gershman

Add to Reading List

Source URL: jair.org

Language: English - Date: 2009-02-10 12:35:28
33Function / Global optimization / Constraint optimization / MCS algorithm / Multidisciplinary design optimization / Mathematical optimization / Mathematics / Operations research

Snobfit – Stable Noisy Optimization by Branch and Fit WALTRAUD HUYER and ARNOLD NEUMAIER Universit¨at Wien The software package Snobfit for bound constrained (and soft constrained) noisy optimization

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2007-11-30 11:24:09
34Parallel computing / Combinatorial optimization / Operations research / Algorithm / Mathematical logic / Theoretical computer science / Branch and bound / Heuristic function / Parallel algorithm / Concurrent computing / Computing / Mathematics

Parallel Branch, Cut, and Price for Large-Scale Discrete Optimization T. K. Ralphs∗ L. Lad´anyi†

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:53
35Dynamic programming / Partially observable Markov decision process / Stochastic control / Branch and bound / NP-complete problems / Statistics / Mathematics / Theoretical computer science

Covering Number for Efficient Heuristic-Based POMDP Planning Zongzhang Zhang ZHANGZZ @ COMP. NUS . EDU . SG David Hsu DYHSU @ COMP. NUS . EDU . SG

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2014-07-04 06:57:08
36Combinatorial optimization / Applied mathematics / Linear programming / Linear programming relaxation / Algorithm / Divide and conquer algorithm / Heuristic function / Branch and cut / Branch and bound / Mathematical optimization / Mathematics / Operations research

Parallel Branch and Cut T.K. Ralphs∗ Revised January 17, 2006 Abstract We discuss the main issues that arise in parallelizing the well-known branch-andcut algorithm for solving mixed-integer linear programs. Designing

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:51
37Logic programming / Constraint programming / Mathematics / Computing / Mathematical optimization / Operations research / Algorithm

Finding Most Likely Haplotypes in General Pedigrees through Parallel Branch and Bound Search Rina Dechter, University of California Irvine Joint work with Lars Otten

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2013-01-24 16:54:54
38Theoretical computer science / Convex optimization / Combinatorial optimization / Linear programming / Relaxation / Branch and bound / Mathematical optimization / Operations research / Applied mathematics

Journal of Uncertain Systems Vol.x, No.x, pp.xx-xx, 2009 Online at: www.jus.org.uk A splitting technique for discrete search based on convex relaxation Martin Fuchs12∗ Arnold Neumaier2

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2009-09-02 12:30:26
39Applied mathematics / Operations research / Combinatorial optimization / Science / Heuristic function / Admissible heuristic / Heuristic / Branch and bound / Algorithm / Heuristics / Mathematics / Search algorithms

Optimal Planning for Delete-free Tasks with Incremental LM-cut Florian Pommerening Malte Helmert Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
40Combinatorial optimization / Operations research / Mathematical logic / Linear programming / Linear programming relaxation / Cutting-plane method / Algorithm / Branch and bound / Branch and cut / Mathematical optimization / Mathematics / Theoretical computer science

Experiments with Branching using General Disjunctions A. Mahajan∗ T.K Ralphs †

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:53
UPDATE